On Determining if Tree-based Networks Contain Fixed Trees
نویسندگان
چکیده
We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is [Formula: see text]-hard to decide, by reduction from 3-Dimensional Matching (3DM) and further that the problem is fixed-parameter tractable.
منابع مشابه
Fuzzy min-max neural network based decision trees
This paper presents a new decision tree learning algorithm, fuzzy min-max decision tree (FMMDT) based on fuzzy min-max neural networks. In contrast with traditional decision trees in which a single attribute is selected as the splitting test, the internal nodes of the proposed algorithm contain a fuzzy min-max neural network. In the proposed learning algorithm, the exibility inherent in the fuz...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملA method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملDomination between Trees and Application to an Explosion Problem
We define a notion of stochastic domination between trees, where one tree dominates another if when the vertices of each are labeled with independent, identically distributed random variables, one tree is always more likely to contain a path with a specified property. Sufficient conditions for this kind of domination are (1) more symmetry and (2) earlier branching. We apply these conditions to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Bulletin of mathematical biology
دوره 78 5 شماره
صفحات -
تاریخ انتشار 2016